Preconditioning techniques for iterative solvers in the discrete sources method
نویسندگان
چکیده
Different preconditioning techniques for the iterative method MinRes as solver for the Discrete Sources Method (DSM) are presented. This semi-analytical method is used for light scattering computations by particles in the Mie scattering regime. Its numerical schema includes a linear least-squares problem commonly solved using the QR decomposition method. This could be the subject of numerical difficulties and instabilities for very large particles or particles with extreme geometry. In these cases, we showed that iterative methods with preconditioning techniques can provide a satisfying solution. In our previous paper, we studied four different iterative solvers (RGMRES, BiCGStab, BiCGStab(l), and MinRes) considering the performance and the accuracy of a solution. Here, we study several preconditioning techniques for the MinRes method for a variety of oblate and prolate spheroidal particles of different size and geometrical aspect ratio. Using preconditioning techniques we highly accelerated the iterative process especially for particles with a higher aspect ratio. Crown Copyright & 2011 Published by Elsevier Ltd. All rights reserved.
منابع مشابه
An Investigation into Preconditioning Iterative Solvers for Hydrodynamic Problems
Two Krylov subspace iterative methods, GMRES and QMR, were studied in conjunction with several preconditioning techniques for solving the linear system raised from the finite element discretisation of incompressible Navier-Stokes equations for hydrodynamic problems. The preconditioning methods under investigation were the incomplete factorisation methods such as ILU(0) and MILU, the Stokes prec...
متن کاملPreconditioning and fast solvers for incompressible flow
−ν∇u+ u.∇u+∇p = f ∇ · u = 0 which are taken to hold in some domain Ω ⊂ IR together with appropriate boundary conditions. We concentrate on the steady state equations; timedependent problems are essentially easier in the context of iterative methods. We will make some comment on this later. The numerical results we present here come from mixed finite element approximation though the techniques a...
متن کاملBoundary preconditioners for mixed finite-element discretizations of fourth-order elliptic problems
Abstract We extend the preconditioning approach of Glowinski and Pironneau, and of Peisker to the case of mixed finite element general fourth-order elliptic problems. We show that H−1/2-preconditioning on the boundary leads to mesh-independent performance of iterative solvers of Krylov subspace type. In particular, we show that the field of values of the boundary Schur complement preconditioned...
متن کاملEfficient and Practical Tree Preconditioning for Solving Laplacian Systems
We consider the problem of designing e cient iterative methods for solving linear systems. In its full generality, this is one of the oldest problems in numerical analysis with a tremendous number of practical applications. We focus on a particular type of linear systems, associated with Laplacian matrices of undirected graphs, and study a class of iterative methods for which it is possible to ...
متن کاملComponent-wise algebraic multigrid preconditioning for the iterative solution of stress analysis problems from microfabrication technology
A methodology for preconditioning discrete stress analysis systems using robust scalar algebraic multigrid (AMG) solvers is evaluated in the context of problems that arise in microfabrication technology. The principle idea is to apply an AMG solver in a segregated way to the series of scalar block matrix problems corresponding to different displacement vector components, thus yielding a block d...
متن کامل